Degree sum conditions for path-factors with specified end vertices in bipartite graphs
نویسندگان
چکیده
منابع مشابه
Degree-Sum Conditions for Graphs to Have 2-Factors with Cycles Through Specified Vertices
Let k ≥ 2 and n ≥ 1 be integers, let G be a graph of order n with minimum degree at least k + 1. Let v1, v2, · · · , vk be k distinct vertices of G, and suppose that there exist k vertex disjoint cycles C1, · · · , Ck in G such that vi ∈ V (Ci) for each 1 ≤ i ≤ k. Suppose further that the minimum value of the sum of the degrees of two nonadjacent distinct vertices is greater than or equal to n ...
متن کاملMinimum Degree Conditions for Cycles Including Specified Sets of Vertices
This paper generalises the concept of vertex pancyclic graphs. We define a graph as set-pancyclic if for every set S of vertices there is a cycle of every possible length containing S. We show that if the minimum degree of a graph exceeds half its order then the graph is set-pancyclic. We define a graph as k-ordered-pancyclic if, for every set S of cardinality k and every cyclic ordering of S, ...
متن کاملCharacterizing degree-sum maximal nonhamiltonian bipartite graphs
In 1963, Moon and Moser gave a bipartite analogue to Ore’s famed theorem on hamiltonian graphs. While the sharpness examples of Ore’s Theorem have been independently characterized in at least four different papers, no similar characterization exists for the Moon-Moser Theorem. In this note, we give such a characterization, consisting of one infinite family and two exceptional graphs of order ei...
متن کاملA note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
Let G be a balanced bipartite graph of order 2n ≥ 4, and let σ1,1(G) be the minimum degree sum of two non-adjacent vertices in different partite sets of G. In [On Hamiltonian bipartite graphs, Israel J. Math. 1 (1963) 163–165], Moon and Moser proved that if σ1,1(G) ≥ n+1, then G is hamiltonian. In this note, we show that if k is a positive integer, then the Moon-Moser condition also implies the...
متن کاملHamiltonian cycles in bipartite toroidal graphs with a partite set of degree four vertices
Let G be a 3-connected bipartite graph with partite sets X ∪ Y which is embeddable in the torus. We shall prove that G has a Hamiltonian cycle if (i) G is blanced , i.e., |X| = |Y |, and (ii) each vertex x ∈ X has degree four. In order to prove the result, we establish a result on orientations of quadrangular torus maps possibly with multiple edges. This result implies that every 4-connected to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2017
ISSN: 0012-365X
DOI: 10.1016/j.disc.2016.07.015